Detecting Communities in K-Partite K-Uniform (Hyper)Networks
نویسندگان
چکیده
منابع مشابه
Packing k-partite k-uniform hypergraphs
Let G and H be k-graphs (k-uniform hypergraphs); then a perfect H-packing in G is a collection of vertex-disjoint copies of H in G which together cover every vertex ofG. For any fixed k-graphH let δ(H,n) be the minimum δ such that any k-graphG on n vertices with minimum codegree δ(G) ≥ δ contains a perfect H-packing. The problem of determining δ(H,n) has been widely studied for graphs (i.e. 2-g...
متن کاملTowards Community Detection in k-Partite k-Uniform Hypergraphs
Recently, numerous applications have emerged that create data most naturally interpreted as k-partite k-uniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a hypergraph generalization of the “caveman” model for the generation of synthetic evaluation dataset...
متن کاملHamilton cycle decompositions of k-uniform k-partite hypergraphs
Let m ≥ 2 and k ≥ 2 be integers. We show that K k×m has a decomposition into Hamilton cycles of Kierstead-Katona type if k | m. We also show that K (3) 3×m − T has a decomposition into Hamilton cycles where T is a 1-factor if and only if 3 m and m = 4. We introduce a notion of symmetry and comment on the existence of symmetric Hamilton cycle decompositions of K (k) k×m.
متن کاملRamsey Properties of Random k-Partite, k-Uniform Hypergraphs
We investigate the threshold probability for the property that every r-coloring of the edges of a random binomial k-uniform hypergraph G(k)(n, p) yields a monochromatic copy of some fixed hypergraph G. In this paper we solve the problem for arbitrary k ≥ 3 and k-partite, k-uniform hypergraphs G.
متن کاملCyclically k-partite digraphs and k-kernels
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent set of vertices (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l). A k-kernel is a (k, k − 1)-kernel. A digraph D is cyclically k-partite if there exists a partition {Vi} i=0 of V (D) suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Technology
سال: 2011
ISSN: 1000-9000,1860-4749
DOI: 10.1007/s11390-011-0177-0